0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-ho \
0.00/0.00	  --no-avatar \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2 \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n185.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 15:52:09 CST 2018
0.00/0.20	% done 6 iterations in 0.003s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(cBLEDSOE_FENG_SV_I1, conjecture,
0.00/0.20	  (((![Xx]: (cP(Xx) => cP(c1_plus(Xx)))) & cP(cO) & 
0.00/0.20	    (![A:($i > $o)]: (((![Xx]: (A(Xx) => A(c1_plus(Xx)))) & A(cO)) => A(n)))) =>
0.00/0.20	   cP(n))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    (((![Xx]: (cP(Xx) => cP(c1_plus(Xx)))) & cP(cO) & 
0.00/0.20	      (![A:($i > $o)]: (((![Xx]: (A(Xx) => A(c1_plus(Xx)))) & A(cO)) => A(n)))) =>
0.00/0.20	     cP(n)))).
0.00/0.20	tff('0', plain, ![X1 : $i > $o]: (X1(n) | ~ X1(cO) | X1(sk_Xx(X1))),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('1', plain, ![X0]: (cP(c1_plus(X0)) | ~ cP(X0)),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('2', plain,
0.00/0.20	    ![X1 : $i > $o]: (X1(n) | ~ X1(cO) | ~ X1(c1_plus(sk_Xx(X1)))),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('3', plain, (~ $true | ~ cP(sk_Xx(cP)) | ~ cP(cO) | cP(n)),
0.00/0.20	    inference('sup-', [status(thm)], ['1', '2'])).
0.00/0.20	tff('4', plain, cP(cO), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('5', plain, (~ $true | ~ cP(sk_Xx(cP)) | ~ $true | cP(n)),
0.00/0.20	    inference('demod', [status(thm)], ['3', '4'])).
0.00/0.20	tff('6', plain, (cP(n) | ~ cP(sk_Xx(cP))),
0.00/0.20	    inference('simplify', [status(thm)], ['5'])).
0.00/0.20	tff('7', plain, ~ cP(n), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('8', plain, ~ cP(sk_Xx(cP)), inference('clc', [status(thm)], ['6', '7'])).
0.00/0.20	tff('9', plain, (~ $true | ~ cP(cO) | cP(n)),
0.00/0.20	    inference('sup-', [status(thm)], ['0', '8'])).
0.00/0.20	tff('10', plain, (~ $true | ~ $true | cP(n)),
0.00/0.20	    inference('demod', [status(thm)], ['9', '4'])).
0.00/0.20	tff('11', plain, cP(n), inference('simplify', [status(thm)], ['10'])).
0.00/0.20	tff('12', plain, ~ $true, inference('sup-', [status(thm)], ['11', '7'])).
0.00/0.20	tff('13', plain, $false, inference('simplify', [status(thm)], ['12'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
